A logarithmic barrier approach for linear programming
نویسندگان
چکیده
منابع مشابه
A goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملWhy the logarithmic barrier function in convex and linear programming?
We provide a simple interpretation of the use of the logarithmic barrier function in convex and linear programming. c © 2000 Elsevier Science B.V. All rights reserved. MSC: 90C05; 90C25
متن کاملA logarithmic barrier cutting plane method for convex programming*
Users may download and print one copy of any publication from the public portal for the purpose of private study or research You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright, please contact...
متن کاملA Logarithmic Barrier Approach to Fischer Function
Recently, reformulation of variational inequalities and complementarity problems as a system of equations or an optimization problem has become a hot topic in the eld of mathematical programming. Various merit functions play important roles in such reformulations. In this paper, among others, we consider the well-known Fischer function and explore its relationship with other merit functions. It...
متن کاملPrimal-dual algorithms for linear programming based on the logarithmic barrier method
In this paper we will deal with primal{dual interior point methods for solving the linear programming problem. We present a short step and a long step path{following primal{dual method and derive polynomial{ time bounds for both methods. The iteration bounds are as usual in the existing literature, namely O(pnL) iterations for the short step, and O(nL) for the long step variant. In the analysis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2017
ISSN: 0377-0427
DOI: 10.1016/j.cam.2016.05.025